Sum of Squares of ‘n’ Consecutive Carol Numbers

On numbers which are the sum of two squares ∗

1. Arithmeticians are accustomed to investigating the nature of numbers in many ways where they show their source, either by addition or by multiplication. Of the aforementioned kind, the simplest is composition from units, by which all integers are understood to arise from units. Then numbers can also thus be considered as they are formed from the addition of two or more other integers, which ...

The Hankel Transform of the Sum of Consecutive Generalized Catalan Numbers

X iv :m at h/ 06 04 42 2v 1 [ m at h. C O ] 1 9 A pr 2 00 6 The Hankel Transform of the Sum of Consecutive Generalized Catalan Numbers Predrag Rajković, Marko D. Petković, University of Nǐs, Serbia and Montenegro Paul Barry School of Science, Waterford Institute of Technology, Ireland Abstract. We discuss the properties of the Hankel transformation of a sequence whose elements are the sums of c...

Three Consecutive Almost Squares

Given a positive integer n, we let sfp(n) denote the squarefree part of n. We determine all positive integers n for which max{sfp(n), sfp(n+ 1), sfp(n+ 2)} ≤ 150 by relating the problem to finding integral points on elliptic curves. We also prove that there are infinitely many n for which max{sfp(n), sfp(n + 1), sfp(n + 2)} < n.

The Sum of Two Squares

A 'sum of Squares' Theorem for Visibility Complexes a 'sum of Squares' Theorem for Visibility Complexes

We present a new and simpler method to implement in constant amortized time the ip operation of the so-called 'Greedy Flip Algorithm', an optimal algorithm to compute the visibility graph/complex of a collection of pairwise disjoint bounded convex sets of constant complexity. The method uses only the incidence structure of the visibility complex and only the primitive predicate which states tha...